Upper bounds in spectral test for multiple recursive random number generators with missing terms
نویسندگان
چکیده
منابع مشابه
An Implementation of the Lattice and Spectral Tests for Multiple Recursive Linear Random Number Generators
We discuss the implementation of theoretical tests to assess the structural properties of simple or combined linear congruential and multiple recursive random number generators. In particular, we describe a package implementing the so-called spectral and lattice tests for such generators. Our programs analyze the lattices generated by vectors of successive or non-successive values produced by t...
متن کاملCriterion of Spectral Test for Linear Congruential Random Number Generators
The criterion issue of spectral test in a linear congruential random number generator is considered. In this paper, we report on four variants of the normalized spectral test, measured both relative to either a theoretical or exact lower bound and aggregative to either a worst-case or average-case method. Computer exhaustive searches are conducted to evaluate and compare their statistical behav...
متن کاملEmpirical Spectral Analysis of Random Number Generators
ABSTRACT. Computer simulation procedures have become a staple of research and development in many fields, including statistics. The generation of random number sequences is critical to these procedures. The validity of research results often depend on the underlying validity of the generator being used. In this work we develop the theory for the Empirical Spectral Test (EST). The EST is a class...
متن کاملRandom-number Generators Physical Random-number Generators
R andom numbers have applications in many areas: simulation, game-playing, cryptography, statistical sampling, evaluation of multiple integrals, particletransport calculations, and computations in statistical physics, to name a few. Since each application involves slightly different criteria for judging the “worthiness” of the random numbers generated, a variety of generators have been develope...
متن کاملAn exhaustive analysis of two-term multiple recursive random number generators with efficient multipliers
This paper presents results of an exhaustive computer search for the maximum spectral value in full period two-term kth-order multiple recursive generators (MRGs) with efficient multipliers. For orders k = 2, 3, . . . , 7, we provide a table of kth-order MRGs with largest spectral values. These MRGs not only have the best spectral values found so far but also can be implemented efficiently by a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 1997
ISSN: 0898-1221
DOI: 10.1016/s0898-1221(97)00012-6